Knowledge Based Programs: On the Complexity of Perfect Recall in Finite Environments

نویسنده

  • Ron van der Meyden
چکیده

Knowledge based programs have been proposed as an abstract formalism for the design of multi-agent protocols, based on the idea that an agent's actions are a function of its state of knowledge. The key questions in this approach concern the relationship between knowledge based programs and their concrete implementations. We present a variant of the framework of Fagin et al. that facilitates the study of a certain sort of optimization of these implementations. Within this framework, we investigate the inherent complexity of the implementations of atemporal knowledge based programs under the assumptions that the environment is finite state, and that agents operate synchronously and with perfect recall. We provide a simple example showing that one cannot expect to always obtain finite state implementations under this assumption. In fact, we show there exist environments in which knowledge based programs may generate behaviour of PSPACE-complete complexity. This is the most complex behaviour possible given our assumptions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge Based Programs : On the Complexity of PerfectRecall in Finite Environments Extended

Knowledge based programs have been proposed as an abstract formalism for the design of multi-agent protocols, based on the idea that an agent's actions are a function of its state of knowledge. The key questions in this approach concern the relationship between knowledge based programs and their concrete implementations. We present a variant of the framework of Fagin et al. that facilitates the...

متن کامل

Finite State Implementations of Knowledge-Based Programs

Knowledge-based programs have been proposed as an abstract formalism for the design of distributed systems, based on the idea that an agent's actions are a function of its state of knowledge. We identify two natural cases in which nite state implementations of atemporal knowledge-based programs in nite environments may be automatically constructed. The rst concerns an interpretation of knowledg...

متن کامل

Constructing Finite State Implementations of Knowledge-based Programs with Perfect Recall ? (extended Abstract)

Knowledge-based programs have been proposed as an abstract formalism for the design of multi-agent protocols, based on the idea that an agent's actions are a function of its state of knowledge. The key questions in this approach concern the relationship between knowledge-based programs and their concrete implementations, in which the actions are a function of the agents' local states. In previo...

متن کامل

Knowledge = Observation + Memory + Computation

We compare three notions of knowledge in concurrent system: memoryless knowledge, knowledge of perfect recall, and causal knowledge. Memoryless knowledge is based only on the current state of a process, knowledge of perfect recall can take into account the local history of a process, and causal knowledge depends on the causal past of a process, which comprises the information a process can obta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996